Syntactic Graphs: A Representation for the Union of All Ambiguous Parse Trees

نویسندگان

  • Jungyun Seo
  • Robert F. Simmons
چکیده

In this paper, we present a new method of representing the Surface syntactic structure of a sentence. Trees have usually been used in linguistics and natural language processing to represent syntactic structures of a sentence. A tree structure shows only one possible syntactic parse of a sentence, but in order to choose a correct parse, we need to examine all possible tree structures one by one. Syntactic graph representation makes it possible to represent all possible surface syntactic relations in one directed graph (DG). Since a syntactic graph is expressed in terms of a set of triples, higher level semantic processes can access any part of the graph directly without navigating the whole structure. Furthermore, since a syntactic graph represents the union of all possible syntactic readings of a sentence, it is fairly easy to focus on the syntactically ambiguous points. In this paper, we introduce the basic idea of syntactic graph representation and discuss its various properties. We claim that a syntactic graph carries complete syntactic information provided by a parse forestmthe set of all possible parse trees.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

From Generalization of Syntactic Parse Trees to Conceptual Graphs

We define sentence generalization and generalization diagrams as a special sort of conceptual graphs which can be constructed automatically from syntactic parse trees and support semantic classification task. Similarity measure between syntactic parse trees is developed as a generalization operation on the lists of sub-trees of these trees. The diagrams are representation of mapping between the...

متن کامل

Constructing Graceful Graphs with Caterpillars

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

متن کامل

Shared Trees: Representing a Parse Forest with a Single Tree

We describe in this paper a method allowing to represent several trees with a single one. In a natural language processing perspective, this comes to represent a set of parses (which denotes an ambiguity) with a unique structure. This technique makes use of two notions: controlled disjunctions for the encoding of tree nodes and the deenition of a neutral element for the dominance relation. We o...

متن کامل

Identifying Syntactic Ambiguities in Single-Parse Arabic Sentence

The aim of this paper is to describe a technique for identifying the sources of several types of syntactic ambiguity in Arabic Sentences with a single parse only. Normally, any sentence with two or more structural representations is said to be syntactically ambiguous. However, Arabic sentences with only one structural representation may be ambiguous. Our technique for identifying Syntactic Ambi...

متن کامل

Ambiguity-aware Ensemble Training for Semi-supervised Dependency Parsing

This paper proposes a simple yet effective framework for semi-supervised dependency parsing at entire tree level, referred to as ambiguity-aware ensemble training. Instead of only using 1best parse trees in previous work, our core idea is to utilize parse forest (ambiguous labelings) to combine multiple 1-best parse trees generated from diverse parsers on unlabeled data. With a conditional rand...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computational Linguistics

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1989